Computational complexity - PDFSEARCH.IO - Document Search Engine

Computational complexity
Results: 2253

#	Item
741	CCCG 2009, Vancouver, BC, August 17–19, 2009 Inapproximability of the Perimeter Defense Problem Evangelos Kranakis∗ Danny Krizanc† Add to Reading List Source URL: cccg.ca Language: English - Date: 2009-09-02 14:33:48 Computational complexity theory Simple polygon 2-satisfiability Rectilinear polygon Optimization problem APX Vertex Theoretical computer science Polygons Geometry
742	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 An Efficient Exact Algorithm for the Natural Wireless Localization Problem∗ Bruno E. Crepaldi† Pedro J. de Rezende† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:57 Computational complexity theory Art gallery problem Computational geometry Reduction Polygon Simple polygon Linear programming Algorithm Theoretical computer science Applied mathematics Mathematics
743	Algorithms: Complexity Classes and Lower Bounds Martin Held FB Computerwissenschaften Universität Salzburg A-5020 Salzburg, Austria Add to Reading List Source URL: www.cosy.sbg.ac.at Language: English - Date: 2014-10-17 01:42:07 Complexity classes P versus NP problem NP P Low EXPTIME NC Parameterized complexity Karp–Lipton theorem Theoretical computer science Computational complexity theory Applied mathematics
744	Draft of 16 Apr:30 a.m. The Guruswam-Sudan Decoding Algorithm for Reed-Solomon Codes. R. J. McEliece Add to Reading List Source URL: www.systems.caltech.edu Language: English - Date: 2003-04-16 20:16:24 Error detection and correction Algebra Polynomials Finite fields Computational complexity theory List decoding Reed–Solomon error correction Monomial order Monomial Coding theory Abstract algebra Mathematics
745	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-01-05 09:50:09 Complexity classes Approximation algorithms NP-complete problems Matroid theory Generalized assignment problem Knapsack problem Submodular set function APX Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
746	Faster Construction of Planar Two-centers David Eppstein∗ Abstract tical implementation. The method is complicated, and Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 1997-12-08 20:38:05 Analysis of algorithms Computational geometry Probabilistic complexity theory Randomized algorithm Algorithm Time complexity Binary search algorithm LP-type problem Closest pair of points problem Theoretical computer science Applied mathematics Mathematics
747	System Behaviors and Measures: Compressed State Complexity and Number of Unique States Used in Naval Weapons Elevators Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2014-05-30 12:15:58 Structure Applied mathematics Computational complexity theory Finite model theory Complexity Complex systems Physical system FO Algorithm Systems Science Complex systems theory
748	CCCG 2010, Winnipeg MB, August 9–11, 2010 Constrained k-center and Movement to Independence Adrian Dumitrescu∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:19 Operations research NP-complete problems Approximation algorithm Computational complexity theory Facility location Circle Travelling salesman problem Tower of Hanoi Theoretical computer science Geometry Mathematics
749	Computing on Encrypted Data Secure Internet of Things Seminar David Wu January, 2015 New Applications in the Internet of Things Add to Reading List Source URL: iot.stanford.edu Language: English - Date: 2015-01-12 23:28:56 Secure multi-party computation Homomorphic encryption Computational complexity theory Computing Boolean circuit Circuit Mathematics Verifiable computing Secure two-party computation Cryptographic protocols Cryptography Applied mathematics
750	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics S¨oren Laue∗ Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:24:48 Operations research Spanning tree Complexity classes NP-complete problems Minimum spanning tree Steiner tree problem R-tree Approximation algorithm Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics

UPDATE